Using a minimal number of resets when testing from a finite state machine
نویسندگان
چکیده
منابع مشابه
Using a minimal number of resets when testing from a finite state machine
Finite State Machines (FSMs) are used to model a number of classes of systems, including communications protocols and control systems. There has thus been much interest in automating the generation of tests from FSMs [1,5,7,8]. A reset is an operation that takes the system from each state to the initial state. The use of a reset may increase the cost of testing and reduce its effectiveness [2,3...
متن کاملMinimizing the Cost of Fault Location when Testing from a Finite State Machine
If a test does not produce the expected output, the incorrect output may have been caused by an earlier state transfer failure. Ghedamsi and von Bochmann [1992] and Ghedamsi et al. [1993] generate a set of candidates and then produce further tests to locate the failures within this set. We consider the special case where there is a state identification process that is known to be correct. A num...
متن کاملTesting from a Finite-State Machine: Extending Invertibility to Sequences
When testing a system modelled as a nite state machine it is de sirable to minimize the e ort required Yang and Ural demon strate that it is possible to utilize test sequence overlap in order to reduce the test e ort and Hierons represents this overlap by us ing invertible transitions In this paper invertibility will be extended to sequences in order to further reduce the test e ort and encapsu...
متن کاملWhen Can Finite Testing Ensure Infinite Trustworthiness?
In this paper we contribute to the general philosophical question as to whether empirical testing can ever prove a physical law. Problems that lead to this question arise under several contexts, and the matter has been addressed by the likes of Bayes and Laplace. After pointing out that a Bayesian approach is the proper way to address this problem, we show that the answ...
متن کاملGenerating Candidates When Testing a Deterministic Implementation against a Non-deterministic Finite-state Machine
This paper considers the problem of testing a deterministic system against a non-deterministic finite-state machine. An adaptive test process, with two phases, is proposed. The paper focuses on the first stage which involves testing to generate a candidate deterministic finite-state machine. This candidate has the property that, under the test hypotheses used, the implementation is correct if a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2004
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2004.03.003